An Anonymous Bidding Protocol without Any Reliable Center

نویسندگان

  • Toru Nakanishi
  • Toru Fujiwara
  • Hajime Watanabe
چکیده

An anonymous bidding protocol without any reliable center for a small community is proposed. The anonymity of a bidding protocol means that the participation of everyone involved in the bidding except for the successful bidder is kept secret. Since it is hard for a small community to establish a reliable center owing to the difficulty and cost of doing so, an anonymous bidding protocol without any reliable center is appropriate to its needs. In such a bidding protocol, a bidder can withdraw his bid after the deadline for bidding by ceasing to participate in the bidding. If this can be done anonymously, the price of the successful bid would be illegally manipulated by conspiratorial bidders. In the bidding protocol proposed in this paper, such a bidder can be identified. This discourages conspiratorial bidders from manipulating the price of the successful bid through withdrawing, by applying some sanctions against their acts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Anonymous Aution Protocol with a Single Non-trusted Center Using Binary Trees

Some works about an electronic auction protocol have been proposed[2, 3, 4, 5, 6, 8, 11, 12]. An electronic auction protocol should satisfy the following seven properties: (a)Fair of bidders; (b)Security of bids; (c)Anonymity; (d)Validity of winning bids; (e)Non-repudiation; (f)Robustness; and (g)EÆcient bidding points. As for anonymity, previous protocols assume some entities like a dealer or ...

متن کامل

Anonymous Authentication Protocol for Dynamic Groups with Power-Limited Devices

| We propose an anonymous authentication protocol that not only allows much lower computational complexity for practical use but also meets requirements of dynamic groups, especially with power-limited devices. Our contribution is to provide the strict analysis of security based on the framework of provable security. Our protocol consists of a group manager, a veri cation center, and m group me...

متن کامل

Cryptanalysis of a Generalized Anonymous Buyer-Seller Watermarking Protocol of IWDW 2004

In this paper, we analyze the security of a generalized anonymous buyer-seller watermarking protocol recently proposed by Choi and Park at IWDW 2004. We prove that it has not met the designers’ intended security criteria by showing that an attacker can actually: (1) discover the unique buyer’s watermark which was chosen by the watermark certificate center (WCC), and (2) decrypt the encrypted wa...

متن کامل

An Anonymous Electronic Voting Protocol with the Latest Decision on Voters' Intentions

In most of the anonymous electronic voting schemes presented in the literature, every voter must decide his intention for a voting before the tally center performs the signing operation on his vote. In these schemes, voters cannot modify or update their intentions embedded in the signed votes even if they have not been sent to the tally center for tallying yet. This paper presents a new anonymo...

متن کامل

Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks

In recent years, a number of applications of ad-hoc networks have been proposed. Many of them are based on the availability of a robust and reliable multicast protocol. In this paper, we address the issue of reliability and propose a scalable method to improve packet delivery of multicast routing protocols and decrease the variation in the number of packets received by different nodes. The prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007